Search results for "Truncation error"
showing 5 items of 5 documents
Implementation of local chiral interactions in the hyperspherical harmonics formalism
2021
With the goal of using chiral interactions at various orders to explore properties of the few-body nuclear systems, we write the recently developed local chiral interactions as spherical irreducible tensors and implement them in the hyperspherical harmonics expansion method. We devote particular attention to three-body forces at next-to-next-to leading order, which play an important role in reproducing experimental data. We check our implementation by benchmarking the ground-state properties of $^3$H, $^3$He and $^4$He against the available Monte Carlo calculations. We then confirm their order-by-order truncation error estimates and further investigate uncertainties in the charge radii obta…
Stripe formation in doped Hubbard ladders
2004
We investigate the formation of stripes in $7\chunks \times 6$ Hubbard ladders with $4\chunks$ holes doped away from half filling using the density-matrix renormalization group (DMRG) method. A parallelized code allows us to keep enough density-matrix eigenstates (up to $m=8000$) and to study sufficiently large systems (with up to $7\chunks = 21$ rungs) to extrapolate the stripe amplitude to the limits of vanishing DMRG truncation error and infinitely long ladders. Our work gives strong evidence that stripes exist in the ground state for strong coupling ($U=12t$) but that the structures found in the hole density at weaker coupling ($U=3t$) are an artifact of the DMRG approach.
ℓp-solutions of countable infinite systems of equations and applications to electrical circuits
1991
In the preceding chapter we have studied a lumped parameter model of a class of circuits containing a finite number of elements. Here we are interested in qualitative properties of the network in Figure 3.1.
Principal polynomial analysis for remote sensing data processing
2011
Inspired by the concept of Principal Curves, in this paper, we define Principal Polynomials as a non-linear generalization of Principal Components to overcome the conditional mean independence restriction of PCA. Principal Polynomials deform the straight Principal Components by minimizing the regression error (or variance) in the corresponding orthogonal subspaces. We propose to use a projection on a series of these polynomials to set a new nonlinear data representation: the Principal Polynomial Analysis (PPA). We prove that the dimensionality reduction error in PPA is always lower than in PCA. Lower truncation error and increased independence suggest that unsupervised PPA features can be b…
High-accuracy approximation of piecewise smooth functions using the Truncation and Encode approach
2017
Abstract In the present work, we analyze a technique designed by Geraci et al. in [1,11] named the Truncate and Encode (TE) strategy. It was presented as a non-intrusive method for steady and non-steady Partial Differential Equations (PDEs) in Uncertainty Quantification (UQ), and as a weakly intrusive method in the unsteady case. We analyze the TE algorithm applied to the approximation of functions, and in particular its performance for piecewise smooth functions. We carry out some numerical experiments, comparing the performance of the algorithm when using different linear and non-linear interpolation techniques and provide some recommendations that we find useful in order to achieve a hig…